Solving the Station Repacking Problem
نویسندگان
چکیده
We investigate the problem of repacking stations in the FCC’s upcoming, multi-billion-dollar “incentive auction”. Early efforts to solve this problem considered mixed-integer programming formulations, which we show are unable to reliably solve realistic, national-scale problem instances. We describe the result of a multi-year investigation of alternatives: a solver, SATFC, that has been adopted by the FCC for use in the incentive auction. SATFC is based on a SAT encoding paired with a wide range of techniques: constraint graph decomposition; novel caching mechanisms that allow for reuse of partial solutions from related, solved problems; algorithm configuration; algorithm portfolios; and the marriage of local-search and complete solver strategies. We show that our approach solves virtually all of a set of problems derived from auction simulations within the short time budget required in practice.
منابع مشابه
Performance enhancement of repacking and borrowing mechanisms for IEEE 802.16j multihop resource scheduling
1389-1286/$ see front matter 2011 Elsevier B.V doi:10.1016/j.comnet.2011.07.024 ⇑ Corresponding author. Tel.: +886 3 5731212; fa E-mail addresses: [email protected] [email protected] (S.-R. Yang), nothing.03@gm The IEEE 802.16j standard has been proposed to triumph over the shadow fading and path attenuation problems in IEEE 802.16e networks by employing the multihop relay (MR) techno...
متن کاملThe Broadcaster-Repacking Problem
The Federal Communications Commission’s (FCC’s) ongoing Incentive Auction will, if successful, transfer billions of dollars of radio spectrum from television broadcasters to mobile-network operators. Hundreds of broadcasters may go off the air. Most of those remaining on the air, including hundreds of Canadian broadcasters not bidding, will have to move to new channels to continue broadcasting....
متن کاملThe Repacking Efficiency for Bandwidth Packing Problem
Repacking is an efficient scheme for bandwidth packing problem (BPP) in centralized networks (CNs), where a central unit allocates bandwidth to the rounding terminals. In this paper, we study its performance by proposing a new formulation of the BPP in the CN, and introducing repacking scheme into next fit algorithm in terms of the online constraint. For the realistic applications, the effect o...
متن کاملFleet Size and Frequency in Rapid Transit Systems
Given is a set of stations linked by railway tracks, forming an undirected railway network. One or more lines are formed in this network. Each line consists of an origin station, a destination station, and a number of intermediate stations. In order to complete the line configuration, you need to decide the frequency (number of services per hour) and the capacity (number of carriages) for each ...
متن کاملSolving the tandem AGV network design problem using tabu search: Cases of maximum workload and workload balance with fixed and non-fixed number of loops
A tandem AGV configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. Each loop has at least one additional P/D station, provided as an interface between adjacent loops. This study describes the development of three tabu search algorithms for the design of tandem AGV systems. The first algorithm was developed based on the basic definiti...
متن کامل